Quantized Compressive Sensing Measurement Based on Improved Subspace Pursuit Algorithm

نویسنده

  • LIU TAO
چکیده

Recent research results in compressive sensing have shown that sparse signals can be recovered from a small number of random measurements. Whether quantized compressive measurements can provide an efficient representation of sparse signals in information-theoretic needs discuss. In this paper, the distortion rate functions are used as a tool to research the quantizing compressive sensing measurements bring about average distortion rate. Both uniform quantization and non-uniform quantization were considered, for quantized measurements, the improved subspace pursuit was adapted to accommodate quantization error based on the concept of consistency, and experimental results show that the improved algorithm significantly reduces the reconstruction distortion when compared to standard compressive sensing techniques. Key-Words: Compressive Sensing; Rate Distortion Function; Subspace Pursuit

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantized Iterative Hard Thresholding: Bridging 1-bit and High-Resolution Quantized Compressed Sensing

In this work, we show that reconstructing a sparse signal from quantized compressive measurement can be achieved in an unified formalism whatever the (scalar) quantization resolution, i.e., from 1-bit to high resolution assumption. This is achieved by generalizing the iterative hard thresholding (IHT) algorithm and its binary variant (BIHT) introduced in previous works to enforce the consistenc...

متن کامل

Hard Thresholding Pursuit: An Algorithm for Compressive Sensing

We introduce a new iterative algorithm to find sparse solutions of underdetermined linear systems. The algorithm, a simple combination of the Iterative Hard Thresholding algorithm and of the Compressive Sampling Matching Pursuit or Subspace Pursuit algorithms, is called Hard Thresholding Pursuit. We study its general convergence, and notice in particular that only a finite number of iterations ...

متن کامل

Improved Analyses for SP and CoSaMP Algorithms in Terms of Restricted Isometry Constants

In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery complexity greatly comparing with the well-known l1-minimization. Restricted isometry property (RIP) and restricted isometry constant (RIC) of measurement matrices which ensure the converg...

متن کامل

Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing

In compressive sensing, the fundamental problem is to reconstruct sparse signal from its nonadaptive insufficient linear measurement. Besides sparse signal reconstruction algorithms, measurement matrix or measurement dictionary plays an important part in sparse signal recovery. Orthogonal Matching Pursuit (OMP) algorithm, which is widely used in compressive sensing, is especially affected by me...

متن کامل

Sparse Recovery Algorithms: Sufficient Conditions in terms of Restricted Isometry Constants

We review three recovery algorithms used in Compressive Sensing for the reconstruction s-sparse vectors x ∈ CN from the mere knowledge of linear measurements y = Ax ∈ Cm, m < N. For each of the algorithms, we derive improved conditions on the restricted isometry constants of the measurement matrix A that guarantee the success of the reconstruction. These conditions are δ2s < 0.4652 for basis pu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016